#include<iostream>
#include<vector>
#include<queue>
#include<cstring>
#include<cmath>
#include<map>
#include<set>
#include<cstdio>
#include<algorithm>
#define debug(a) cout<<#a<<"="<<a<<endl;
using namespace std;
const int maxn=200;
typedef long long LL;
inline LL read(){LL x=0,f=1;char ch=getchar();	while (!isdigit(ch)){if (ch=='-') f=-1;ch=getchar();}while (isdigit(ch)){x=x*10+ch-48;ch=getchar();}
return x*f;}
LL a[maxn];
int main(void){
   cin.tie(0);std::ios::sync_with_stdio(false);
   LL t;cin>>t;
   while(t--){
      LL n;cin>>n;
      memset(a,0,sizeof(a));
      for(LL i=1;i<=n;i++){
         cin>>a[i];
      }
      if(n==1){
        cout<<"T"<<"\n";
        continue;
      }
      sort(a+1,a+1+n);
      LL sum1=0;
      for(LL i=1;i<=n-1;i++){
          sum1+=a[i];
      }
      if(sum1<a[n]){
         cout<<"T"<<"\n";
      }
      else{
         sum1-=a[n];
         if(sum1&1){
            cout<<"T"<<"\n";
         }
         else{
            cout<<"HL"<<"\n";
         }
      }
   }
   return 0;
}
